Positive Reducts of Relevance Logic and Algebras of Binary Relations
نویسنده
چکیده
We prove that algebras of binary relations whose similarity type includes intersection, union, and one of the residuals of relation composition form a non-finitely axiomatizable quasivariety and that the equational theory is not finitely based. We apply this result to the problem of the completeness of the positive fragment of relevance logic with respect to binary relations.
منابع مشابه
Complexity of Equations Valid in Algebras of Relations: Part II: Finite Axiomatizations
We study algebras whose elements are relations, and the operations are natural \manipulations" of relations. This area goes back to 140 years ago to works of De Morgan, Peirce, Schrr oder (who expanded the Boolean tradition with extra operators to handle algebras of binary relations). Well known examples of algebras of relations are the varieties RCA n of cylindric algebras of n-ary relations, ...
متن کاملPositive Fragments of Relevance Logic and Algebras of Binary Relations
We prove that algebras of binary relations whose similarity type includes intersection, union, and one of the residuals of relation composition form a non-finitely axiomatizable quasivariety and that the equational theory is not finitely based. We apply this result to the problem of the completeness of the positive fragment of relevance logic with respect to binary relations.
متن کاملComplexity of Equations Valid in Algebras of Relations: Part I: Strong Non-Finitizability
We study algebras whose elements are relations, and the operations are natural \manipulations" of relations. This area goes back to 140 years ago to works of De Morgan, Peirce, Schrr oder (who expanded the Boolean tradition with extra operators to handle algebras of binary relations). Well known examples of algebras of relations are the varieties RCA n of cylindric algebras of n-ary relations, ...
متن کاملResiduated Algebras of Binary Relations and Positive Fragments of Relevance Logic
The aim of this paper is to apply some results obtained jointly with Hajnal Andréka and István Németi about finite axiomatizability of Tarski’s representable relation algebras in the context of completeness of fragments of relevance logic.
متن کاملAlgebras of Relations and Relevance Logic
We prove that algebras of binary relations whose similarity type includes intersection, composition, converse negation and the identity constant form a non-finitely axiomatizable quasivariety and that the equational theory is not finitely based. We apply this result to the problem of the completeness of relevant logic with respect to binary relations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010